Mean-Shift Visual Tracking with NP-Windows Density Estimates

نویسندگان

  • Ian D. Reid
  • Chuan Zhao
چکیده

The mean-shift algorithm is a robust and easy method of finding local extrema in the density distribution of a data set. It has been used successfully for visual tracking in which the target is modelled using a colour histogram, and the image window with best matching histogram is sought. However a histogram is potentially a poor estimate of the underlying colour distribution: it is not invariant to the image scale, the number of histogram bins or the number of samples, and this can have an adverse affect on the speed and accuracy of convergence of the mean-shift algorithm. We apply a general non-parametric PDF estimation method [7] to replace the histogram in mean-shift tracking to improve its accuracy. This algorithm uses an interpolation scheme which fits piecewise functions to the signal samples, calculating the PDF by accumulating the contribution of each piecewise function. Its accuracy is dependent only on the accuracy of the piecewise representation, not the number of samples or the number of bins. Experiments are conducted to demonstrate that we improve mean-shift visual tracking both in accuracy and speed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

اصلاح ردیاب انتقال متوسط برای ردگیری هدف با الگوی تابشی متغیر

The mean shift algorithm is one of the popular methods in visual tracking for non-rigid moving targets. Basically, it is able to locate repeatedly the central mode of a desirable target. Object representation in mean shift algorithm is based on its feature histogram within a non-oriented individual kernel mask. Truly, adjusting of the kernel scale is the most critical challenge in this method. ...

متن کامل

Fast Global Kernel Density Mode Seeking with application to Localisation and Tracking

We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible to local maxima, and hence often fails to find the desired global maximum. In this work, we propose a multi-bandwidth mean shift procedure that alleviates this problem, which we term annealed mean shift, as it shares ...

متن کامل

A review of mean-shift algorithms for clustering

A natural way to characterize the cluster structure of a dataset is by finding regions containing a high density of data. This can be done in a nonparametric way with a kernel density estimate, whose modes and hence clusters can be found using mean-shift algorithms. We describe the theory and practice behind clustering based on kernel density estimates and mean-shift algorithms. We discuss the ...

متن کامل

Applying mean shift and motion detection approaches to hand tracking in sign language

Hand gesture recognition is very important to communicate in sign language. In this paper, an effective object tracking and hand gesture recognition method is proposed. This method is combination of two well-known approaches, the mean shift and the motion detection algorithm. The mean shift algorithm can track objects based on the color, then when hand passes the face occlusion happens. Several...

متن کامل

A Novel View of Color-Based Visual Tracker Using Principal Component Analysis

An extension of the traditional color-based visual tracker, i.e., the continuously adaptive mean shift tracker, is given for improving the convenience and generality of the color-based tracker. This is achieved by introducing a probability density function for pixels based on the hue histogram of object. As its merits, the direction and size of the tracked object are easily derived by the princ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010